Construction of third-order Hamiltonian graphs
نویسندگان
چکیده
منابع مشابه
Construction schemes for fault-tolerant Hamiltonian graphs
In this paper, we present three construction schemes for fault-tolerant Hamiltonian graphs. We show that applying these construction schemes on fault-tolerant Hamiltonian graphs generates graphs preserving the original Hamiltonicity property. We apply these construction schemes to generate some known families of optimal 1-Hamiltonian graphs in the literature and the Hamiltonicity properties of ...
متن کاملCayley graphs of order 30p are Hamiltonian
Correspondence should be addressed to Dave Witte Morris, [email protected] Received 22 January 2011; Accepted 18 April 2011 Academic Editor: Cai Heng Li Copyright q 2011 E. Ghaderpour and D. W. Morris. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original w...
متن کاملCritical Periods of Third-Order Planar Hamiltonian Systems
Periodic motion or oscillation is a common phenomenon which exists in almost all disciplines of physical and engineering systems. Limit cycle is one of the source generating periodic motion, and its study plays an important role in the research of nonlinear dynamical systems. A related wellknown problem to limit cycle is Hilbert’s 16th problem [Hilbert, 1902], which has attracted many mathemati...
متن کاملHamiltonian dynamics of breathers with third-order dispersion
We present a nonperturbative analysis of certain dynamical aspects of breathers (dispersion-managed solitons) including the effects of third-order dispersion. The analysis highlights the similarities to and differences from the well-known analogous procedures for second-order dispersion. We discuss in detail the phase-space evolution of breathers in dispersion-managed systems in the presence of...
متن کاملConstruction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs
In this letter we present a new construction of interleavers for turbo codes from 3-regular Hamiltonian graphs. The interleavers can be generated using a few parameters, which can be selected in such a way that the girth of the interleaver graph (IG) becomes large, inducing a high summary distance. The size of the search space for these parameters is derived. The proposed interleavers themselve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1962
ISSN: 0528-2195
DOI: 10.21136/cpm.1962.117423